Many cliques with few edges and bounded maximum degree
نویسندگان
چکیده
Generalized Tur\'an problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem, maximizing number cliques fixed order graph with vertices and bounded maximum degree, was recently completely resolved by Chase. Kirsch Radcliffe raised natural variant this problem where edges is instead vertices. In paper, we determine resolving conjecture Radcliffe. We also give complete characterization graphs.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملCliques in Graphs With Bounded Minimum Degree
Let fr(n, e) be the minimum number of r-cliques in graphs of order n and size e. Determining fr(n, e) has been a long-studied problem. The case r = 3, that is, counting triangles, has been studied by various people. Erdős [3], Lovász and Simonovits [7] studied the case when e = ( n 2 ) /2 + l with 0 < l n/2. Fisher [4] considered the situation when ( n 2 ) /2 e 2 ( n 2 ) /3, but it was not unti...
متن کاملMaximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
We determine the maximum number of edges that a claw-free graph can have, when its maximum degree and matching number are bounded. This is a famous problem that has been studied on general graphs, and for which there is a tight bound. The graphs achieving this bound contain in most cases an induced copy of K1,3, the claw, which motivates studying the question on claw-free graphs. Note that on g...
متن کاملGeometric spanners with few edges and degree five
An O(n log n)–time algorithm is presented that, when given a set S of n points in R and an integer k with 0 ≤ k ≤ n, computes a graph with vertex set S, that contains at most n − 1 + k edges, has stretch factor O(n/(k+1)), and whose degree is at most five. This generalizes a recent result of Aronov et al., who obtained this result for two-dimensional point sets.
متن کاملSolving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees
Given a set of leaf-labeled trees with identical leaf sets, the well-known Maximum Agreement SubTree problem (MAST) consists of finding a subtree homeomorphically included in all input trees and with the largest number of leaves. Its variant called Maximum Compatible Tree (MCT) is less stringent, as it allows the input trees to be refined. Both problems are of particular interest in computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2021
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2021.05.005